Distributed Primal-Dual Perturbation Algorithm Over Unbalanced Directed Networks
نویسندگان
چکیده
منابع مشابه
Prox-PDA: The Proximal Primal-Dual Algorithm for Fast Distributed Nonconvex Optimization and Learning Over Networks
In this paper we consider nonconvex optimization and learning over a network of distributed nodes. We develop a Proximal Primal-Dual Algorithm (Prox-PDA), which enables the network nodes to distributedly and collectively compute the set of first-order stationary solutions in a global sublinear manner [with a rate of O(1/r), where r is the iteration counter]. To the best of our knowledge, this i...
متن کاملThe Primal - dual Algorithm
As we have seen before, using strong duality, we know that the optimum value for the following two linear programming are equal, i.e. u = w, if they are both feasible. u = max{cx : Ax ≤ b, x ≥ 0} (P ) w = min{b y : A y ≥ c, y ≥ 0} (D) Using the above result, we can check the optimality of a primal and/or a dual solution. Theorem 1. Suppose x and y are feasible solutions to (P ) and (D). Then x ...
متن کاملCommunication-Efficient Distributed Primal-Dual Algorithm for Saddle Point Problem
Primal-dual algorithms, which are proposed to solve reformulated convex-concave saddle point problems, have been proven to be effective for solving a generic class of convex optimization problems, especially when the problems are ill-conditioned. However, the saddle point problem still lacks a distributed optimization framework where primal-dual algorithms can be employed. In this paper, we pro...
متن کاملA Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover
In this paper we consider the capacitated vertex cover problem which is the variant of vertex cover where each node is allowed to cover a limited number of edges. We present an efficient, deterministic, distributed approximation algorithm for the problem. Our algorithm computes a (2 + ǫ)-approximate solution which violates the capacity constraints by a factor of (4 + ǫ) in a polylogarithmic num...
متن کاملPrimal-dual Power Series Algorithm
23] C.L. Monma and A.J. Morton. Computational experimental with a dual aane variant of Karmarkar's method for linear programming. extension of Karmarkar type algorithm to a class of convex separable programming problems with global linear rate of convergence. Techni-28] J. Renegar. A polynomial-time algorithm based on Newton's method for linear programming. Implementing an interior point method...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2021
ISSN: 2169-3536
DOI: 10.1109/access.2021.3082537